Quantum searches on highly symmetric graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walks on Highly Symmetric Graphs

We consider uniform random walks on finite graphs with n nodes. When the hitting times are symmetric, the expected covering time is at least 89 log n O(n log log n) uniformly over all such graphs. We also obtain bounds for the covering times in terms of the eigenvalues of the transition matrix of the Markov chain. For distance-regular graphs, a general lower bound of ( n 1 ) l o g n is obtained...

متن کامل

Random walks and orthogonal functions associated with highly symmetric graphs

The relationship of orthogonal functions associated with vertex transitive graphs and random walks on such graphs is investigated. We use this relations to characterize the exponentially decaying autocorrelation functions along random walks on isotropic random elds de ned on vertex transitive graphs. The results are applied to a simple spin glass model. Motivation Recently \combinatory landscap...

متن کامل

Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes

We present a symmetric LDPC code with constant rate and constant distance (i.e. good LDPC code) that its constraint space is generated by the orbit of one constant weight constraint under a group action. Our construction provides the first symmetric LDPC good codes. This solves the main open problem raised by Kaufman and Wigderson in [4].

متن کامل

Classifying pentavalnet symmetric graphs of order $24p$

A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.

متن کامل

Approximations of permutation-symmetric vertex couplings in quantum graphs

We consider boundary conditions at the vertex of a star graph which make Schrödinger operators on the graph self-adjoint, in particular, the two-parameter family of such conditions invariant with respect to permutations of graph edges. It is proved that the corresponding operators can be approximated in the norm-resolvent sense by elements of another Schrödinger operator family on the same grap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2009

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.79.012323